Variable Preference Modeling Using Multi-Objective Evolutionary Algorithms

Decision making in the presence of multiple and conflicting objectives requires preference from the decision maker. The decision maker’s preferences give rise to a domination structure. Till now, most of the research has been focussed on the standard domination structure based on the Pareto-domination principle. However, various real world applications like medical image registration, financial applications, multicriteria n-person games, among others, or even the preference model of decision makers frequently give rise to a so-called variable domination structure, in which the domination itself changes from point to point. Although variable domination is studied in the classical community since the early seventies, we could not find a single study in the evolutionary domain, even though, as the results of this paper show, multi-objective evolutionary algorithms can deal with the vagaries of a variable domination structure. The contributions of this paper are multiple-folds. Firstly, the algorithms are shown to be able to find a well-diverse set of the optimal solutions satisfying a variable domination structure. This is shown by simulation results on a number of test-problems. Secondly, it answers a hitherto open question in the classical community to develop a numerical method for finding a well-diverse set of such solutions. Thirdly, theoretical results are derived which facilitate the use of an evolutionary multi-objective algorithm. The theoretical results are of importance on their own. The results of this paper adequately show the niche of multi-objective evolutionary algorithms in variable preference modeling.